On Total Coloring of Some Classes of Regular Graphs
نویسندگان
چکیده
In this paper, we have obtained the total chromatic number of some classes Cayley graphs, odd graphs and mock threshold graphs.
منابع مشابه
List strong edge coloring of some classes of graphs
A strong edge coloring of a graph is a proper edge coloring in which every color class is an induced matching. The strong chromatic index of a graph is the minimum number of colors needed to obtain a strong edge coloring. In an analogous way, we can define the list version of strong edge coloring and list version of strong chromatic index. In this paper we prove that if G is a graph with maximu...
متن کاملEdge Coloring by Total Labelings of 4-regular Circulant Graphs
Edge-coloring total k-labeling of a connected graph G is an assignment f of non negative integers to the vertices and edges of G such that two adjacent edges e = uv and e = uv of G have different weights. The weight of an edge uv is defined by: w(e = uv) = f(u) + f(v) + f(e). In this paper, we study the chromatic number of the edge coloring by total labeling of 4-regular circulant graphs Cn(1, k).
متن کاملSelective Graph Coloring in Some Special Classes of Graphs
In this paper, we consider the selective graph coloring problem. Given an integer k ≥ 1 and a graph G = (V,E) with a partition V1, . . . , Vp of V , it consists in deciding whether there exists a set V ∗ in G such that |V ∗ ∩ Vi| = 1 for all i ∈ {1, . . . , p}, and such that the graph induced by V ∗ is k-colorable. We investigate the complexity status of this problem in various classes of graphs.
متن کاملDefective Coloring on Classes of Perfect Graphs
In Defective Coloring we are given a graph G and two integers χd,∆ ∗ and are asked if we can χd-color G so that the maximum degree induced by any color class is at most ∆∗. We show that this natural generalization of Coloring is much harder on several basic graph classes. In particular, we show that it is NP-hard on split graphs, even when one of the two parameters χd,∆ ∗ is set to the smallest...
متن کاملTotal coloring of planar graphs without some chordal 6-cycles
A k-total-coloring of a graph G is a coloring of vertex set and edge set using k colors such that no two adjacent or incident elements receive the same color. In this paper, we prove that if G is a planar graph with maximum ∆ ≥ 8 and every 6-cycle of G contains at most one chord or any chordal 6-cycles are not adjacent, then G has a (∆ + 1)-total-coloring.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Taiwanese Journal of Mathematics
سال: 2022
ISSN: ['1027-5487', '2224-6851']
DOI: https://doi.org/10.11650/tjm/220105